Rational Functions, Diagonals, Automata and Arithmetic

نویسندگان

  • Kurt Mahler
  • Alfred J. van der Poorten
چکیده

1.1 By R we denote an integral domain; then R[[x]] is the ring of formal power series over R in the variables x = (x1, . . . , xn). We write a series f(x) ∈ R[[x]] as f(x) = ∑ ai1···inx i1 1 · · ·xin n = ∑ aνx ν where ν = (ν1, . . . , νn) is a multi-index and x = x1 1 · · ·xνn n . In the sequel R is usually the finite field Fp of p elements or the ring of p-adic integers Zp. One says that f(x) ∈ R[[x]] is algebraic if it is algebraic over the quotient field of the polynomial ring R[x]. If f(x) ∈ Zp[[x]] we say that f is algebraic mod p if there is an algebraic g(x) ∈ Zp[[x]] with f ≡ g mod p.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Diagonals of rational functions and selected differential Galois groups

We recall that diagonals of rational functions naturally occur in lattice statistical mechanics and enumerative combinatorics. In all the examples emerging from physics, the minimal linear differential operators annihilating these diagonals of rational functions have been shown to actually possess orthogonal or symplectic differential Galois groups. In order to understand the emergence of such ...

متن کامل

Positivity of rational functions and their diagonals

The problem to decide whether a given rational function in several variables is positive, in the sense that all its Taylor coefficients are positive, goes back to Szegő as well as Askey and Gasper, who inspired more recent work. It is well known that the diagonal coefficients of rational functions are D-finite. This note is motivated by the observation that, for several of the rational function...

متن کامل

Optimization of Quantum Cellular Automata Circuits by Genetic Algorithm

Quantum cellular automata (QCA) enables performing arithmetic and logic operations at the molecular scale. This nanotechnology promises high device density, low power consumption and high computational power. Unlike the CMOS technology where the ON and OFF states of the transistors represent binary information, in QCA, data is represented by the charge configuration. The primary and basic devic...

متن کامل

Convex Hull of Arithmetic Automata

Arithmetic automata recognize infinite words of digits denoting decompositions of real and integer vectors. These automata are known expressive and efficient enough to represent the whole set of solutions of complex linear constraints combining both integral and real variables. In this paper, the closed convex hull of arithmetic automata is proved rational polyhedral. Moreover an algorithm comp...

متن کامل

ON SOMEWHAT FUZZY AUTOMATA CONTINUOUS FUNCTIONS IN FUZZY AUTOMATA TOPOLOGICAL SPACES

In this paper, the concepts of somewhat fuzzy automata continuous functions and somewhat fuzzy automata open functions in fuzzy automata topological spaces are introduced and some interesting properties of these functions are studied. In this connection, the concepts of fuzzy automata resolvable spaces and fuzzy automata irresolvable spaces are also introduced and their properties are studied.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2001